A Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem

Authors

  • Alinaghian, Mehdi Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran
  • Kaviani, Zahra Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran
  • Khaledan, Siyavash Department of Industrial Engineering at Iran University of Science and Technology, Tehran, Iran
Abstract:

A significant portion of Gross Domestic Production (GDP) in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG). In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (GCW) for Vehicle Routing Problem regarding to fuel consumption is presented. The objective function is fuel consumption, drivers, and the usage of vehicles. Being compared to exact methods solutions for small-sized problems and to Differential Evolution (DE) algorithm solutions for large-scaled problems, the results show efficient performance of the proposed GCW algorithm.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

a novel heuristic algorithm based on clark and wright algorithm for green vehicle routing problem

a significant portion of gross domestic production (gdp) in any country belongs to the transportation system. transportation equipment, in the other hand, is supposed to be great consumer of oil products. many attempts have been assigned to the vehicles to cut down greenhouse gas (ghg). in this paper a novel heuristic algorithm based on clark and wright algorithm called green clark and wright (...

full text

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

full text

A Heuristic Approach Based on Clarke-Wright Algorithm for Open Vehicle Routing Problem

We propose a heuristic approach based on the Clarke-Wright algorithm (CW) to solve the open version of the well-known capacitated vehicle routing problem in which vehicles are not required to return to the depot after completing service. The proposed CW has been presented in four procedures composed of Clarke-Wright formula modification, open-route construction, two-phase selection, and route p...

full text

A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM

The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...

full text

A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

full text

a swift heuristic algorithm base on data mining approach for the Periodic Vehicle Routing Problem: data mining approach

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 2  issue 2

pages  784- 797

publication date 2015-08

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

No Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023